Complementarity and Cost Reduction :
نویسندگان
چکیده
The success of Japanese manufacturing firms such as Honda and Toyota has renewed attention to the importance of cost reduction on existing products as a source of productivity growth. Using survey data and interviews, this paper explores the determinants of average-cost reduction for a sample of 207 automotive suppliers in the United States and Canada between 1988 and 1992. In particular, the paper explores the efficacy of methods for mobilizing latent knowledge from decentralized sources such as workers and customers, or “voice”. Plants using voice practices did better than other plants if they had a highly effective suggestion program for workers, or if they adopted at least two voice practices, such as a) suggestions from workers and long-term, informationrich relations with customers, or b) suggestions from workers and efficiency wages for workers. Despite this evidence that certain practices may be complementary in their performance, there was little complementarity in adoption. (For example, firms with suggestion systems are slightly less likely to have voice with their customers.) This outcome was attributed to incomplete diffusion of the organizational innovation of ‘voice’. Thanks to Adam Jaffe, Kathryn Shaw, Richard Parkin, Laura Leete, Bob Slonim, Jim Rebitzer, and Scott Stern for helpful discussion, and to Lee Handwerger for research assistance. Thanks to the Alfred P. Sloan Foundation for funding via grants provided to the National Bureau of Economic Research Project on Industrial Technology and Productivity and to the MIT International Motor Vehicle Program. Additional support was provided by the Center for Regional Economic Issues at Case Western Reserve University and the Center for Global Partnership in Tokyo.
منابع مشابه
Direct Reduction of PPAD Linear Complementarity Problems to Bimatrix Games
It is well known that the problem of finding a Nash equilibrium for a bimatrix game (2-NASH) can be formulated as a linear complementarity problem (LCP). In addition, 2NASH belongs to the complexity class PPAD (Polynomialtime Parity Argument Directed). Based on the close connection between the graph associated with the Lemke algorithm, a vertex following algorithm for LCP, and the graph used to...
متن کاملA full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کاملAn interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
In this paper, an interior-point algorithm for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...
متن کاملAn infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...
متن کاملSome Results about Set-Valued Complementarity Problem
This paper is devoted to consider the notions of complementary problem (CP) and set-valued complementary problem (SVCP). The set-valued complementary problem is compared with the classical single-valued complementary problem. Also, the solution set of the set-valued complementary problem is characterized. Our results illustrated by some examples. This paper is devoted to co...
متن کامل